Reasoning about definiteness without articles∗

نویسندگان

  • James N. Collins
  • Cleo Condoravdi
  • Christopher Potts
  • Paul Kiparsky
  • Ivano Caponigro
  • Dylan Bumford
  • Lelia Glass
چکیده

• Pragmatic competition must be sensitive to the grammatical well-formedness of alternatives: alternatives must be grammatical in order to compete. • In cases where meanings are not associated with particular morphemes but with complex constructions, deriving certain implicatures must involve comparison between syntactically complex expressions. • For such cases, comparing themeanings of isolated lexical items is not sufficient in deriving the implicature (Schlenker 2012; Singh 2011, cf. Percus 2006).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about definiteness in a language without articles ∗

Most theories of implicature make reference to a notion of alternatives. Interlocutors reason about what the speaker could have said. In this paper, I investigate the structure of these alternatives. In particular, I ask how these alternative utterances are constrained by the interlocutors’ grammar. I argue that in order to derive certain implicatures, alternative utterances must be analyzed li...

متن کامل

Articulated definiteness without articles

Many of the world’s languages lack direct translations of definite articles in English, allowing bare nouns or other nominal expressions in definite contexts. Because articles are taken to head a DP projection in languages that have them (Abney 1987; Szabolcsi 1994), an attractive analysis of languages without definite articles is that they lack a DP projection, a perspective recently advocated...

متن کامل

Building an Ontology That Helps Identify Criminal Law Articles That Apply to a Cybercrime Case

We present in this paper a small formal cybercrime ontology by using concrete tools. The purpose is to show how law articles and legal cases could be defined so that the problem of case resolution is reduced to a classification problem as long as cases are seen as subclasses of articles. Secondly, we show how counterfactual reasoning may be held over it. Lastly, we investigate the implementatio...

متن کامل

Formalizing Counterfactual and Nondeterministic Actions in First Order Logic

This short paper outlines some aspects of a method of axiomatizing actions and their effects in standard first-order logic. The method is closely related to other methods using nonmonotonic logics, but the use of first-order logic permits remarkable simplicity. In particular, there is a single, explicit, fixed, and intuitively meaningful frame axiom. Moreover, complex types of inference are pos...

متن کامل

A Computational Approach to Conceptual Blending within Counterfactuals

An important topic in philosophy and the semantics of natural language has been the representation and verification of counterfactuals. The majority of approaches have taken a classical view of language where statements can be reasoned about solely in terms of their truth functions. This has led to several well known problems in the verification of counterfactuals. We take another view, inspire...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016